Undecidability Results for Low Complexity Degree Structures
نویسندگان
چکیده
We prove that the theory of EXPTIME degrees with respect to polynomial time Turing and many-one reducibility is undecidable. To do so we use a coding method based on ideal lattices of Boolean algebras which was introduced in [7]. The method can be applied in fact to all hyper-polynomial time classes.
منابع مشابه
Undecidability Results for Low Complexity Degree Structures Extended Abstract
We prove that the theory of EXPTIME degrees with respect to polynomial time Turing and many-one re-ducibility is undecidable. To do so we use a coding method based on ideal lattices of Boolean algebras which was introduced in 7]. The method can be applied in fact to all hyper-polynomial time classes.
متن کاملInterpretability and Definability in the Recursively Enumerable Degrees
Coding by ®rst-order formulas in structures arising from computability theory has been a focus of attention for some time. Traditionally, such coding methods are initially used to study the complexity of the theory of the structure. Typically, one ®rst proves that a theory is undecidable by uniformly coding a suf®ciently complex class of structures (with parameters). Then, usually using more so...
متن کاملTowards a Theory of Recursive Structures
In computer science, one is interested mainly in nite objects. Insofar as innnite objects are of interest, they must be computable, i.e., recursive, thus admitting an eeective nite representation. This leads to the notion of a recursive graph, or, more generally, a recursive structure , model or data base. In this paper we summarize our recent work on recursive structures and data bases, includ...
متن کاملUndecidability and Beyond
We discuss the structure of the recursively enumerable sets under three reducibilities: Turing, truth-table and weak truth-table. Weak truth-table reducibility requires that the questions asked of the oracle be eeectively bounded. Truth-table reducibility also demands such a bound on the the length of the computations. We survey what is known about the algebraic structure and the complexity of ...
متن کاملThe Theories of the T, tt and wtt R. E. Degrees: Undecidability and Beyond
We discuss the structure of the recursively enumerable sets under three reducibilities: Turing, truth-table and weak truth-table. Weak truth-table reducibility requires that the questions asked of the oracle be effectively bounded. Truth-table reducibility also demands such a bound on the the length of the computations. We survey what is known about the algebraic structure and the complexity of...
متن کامل